An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
نویسندگان
چکیده
This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message-and space complexity. It was implemented on a transputer network and shown to be more eecient than previously published algorithms.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملLoad Model Effect Assessment on Optimal Distributed Generation Sizing and Allocation Using Improved Harmony Search Algorithm
The operation of a distribution system in the presence of distributed generation systems has someadvantages and challenges. Optimal sizing and siting of DG systems has economic, technical, andenvironmental benefits in distribution systems. Improper selection of DG systems can reduce theseadvantages or even result in deterioration in the normal operation of the distribution system. DGallocation ...
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملImplementing a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs
In general, most deadlocks take form of cycles (in database systems) and knots (in communication systems). Boukerche and Tropper have proposed a distributed algorithm to detect cycles and knots in generic graphs. Their algorithm has a message complexity of 2m vs. (at least) 4m for the Chandy and Misra algorithm, where m is the number of links in the graph, and requires O (n log n) bits of memor...
متن کاملOn-Line Detection and Resolution of Communication Deadlocks
W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i .e . , simultaneously detects and resolves deadlock as communication requests are made, at no additional message t r a f i c overhead, and with bounded delay between the occurrence and detection of a deadlock. This i s achieved via a novel technique for detecting knots, which suf ice for the exi...
متن کامل